Leftover Hashing Against Quantum Side Information

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality of privacy amplification against quantum adversaries and data compression with quantum side information

Information processing protocols are typically built out of simpler parts, called primitives, and two of the most important such primitives are privacy amplification (PA) and data compression. The former extracts the truly secret part of some classical data, while the latter squeezes it into the smallest possible form. We show these tasks are dual in the setting of quantum information processin...

متن کامل

Quantum hashing is maximumly secure against classical leakage

Cryptographic hash functions are fundamental primitives widely used in practice. For such a function f : {0, 1} → {0, 1}, it is nearly impossible for an adversary to produce the hash f(x) without knowing the secret message x ∈ {0, 1}. Unfortunately, all hash functions are vulnerable under the side-channel attack, which is a grave concern for information security in practice. This is because typ...

متن کامل

Classical data compression with quantum side information

The problem of classical data compression when the decoder has quantum side information at his disposal is considered. This is a quantum generalization of the classical Slepian-Wolf theorem. The optimal compression rate is found to be H(X)−χ where H(X) is the Shannon entropy of the source and χ is the Holevo quantity of the ensemble describing the classicalquantum correlations between the sourc...

متن کامل

Bounds on Information Combining With Quantum Side Information

Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kin...

متن کامل

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications

We study the problem of constructing multi-source extractors in the quantum setting, which extract almost uniform random bits against an adversary who collects quantum side information from several initially independent classical random sources. This is a natural generalization of the two much studied problems of seeded randomness extraction against quantum side information, and classical indep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2011

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2158473